A Study on Minimality of the Codewords in the Dual Code of the Code of a Symmetric (v,k,λ ) -Design
نویسنده
چکیده
The Fq code of a symmetric (v,k,λ )design is a subspace generated by the incidence matrix of the symmetric design. In this paper, we examine the minimality of the codewords in the dual codeC⊥ of the binary codeC of a symmetric (v,k,λ )− design. So, we use the relationship between the minimum and maximum nonzero weights in the dual code C⊥ with the number of Fq.
منابع مشابه
BLIND PARAMETER ESTIMATION OF A RATE k/n CONVOLUTIONAL CODE IN NOISELESS CASE
This paper concerns to blind identification of a convolutional code with desired rate in a noiseless transmission scenario. To the best of our knowledge, blind estimation of convolutional code based on only the received bitstream doesn’t lead to a unique solution. Hence, without loss of generality, we will assume that the transmitter employs a non-catastrophic encoder. Moreover, we consider a c...
متن کاملOperator-valued bases on Hilbert spaces
In this paper we develop a natural generalization of Schauder basis theory, we term operator-valued basis or simply ov-basis theory, using operator-algebraic methods. We prove several results for ov-basis concerning duality, orthogonality, biorthogonality and minimality. We prove that the operators of a dual ov-basis are continuous. We also dene the concepts of Bessel, Hilbert ov-basis and obta...
متن کاملFlag-transitive Point-primitive symmetric designs and three dimensional projective special linear groups
The main aim of this article is to study (v,k,λ)-symmetric designs admitting a flag-transitive and point-primitive automorphism group G whose socle is PSL(3,q). We indeed show that the only possible design satisfying these conditions is a Desarguesian projective plane PG(2,q) and G > PSL(3,q).
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملSquare Designs on New Binary ( 3 n − 1 2 , 3 n − 1 2 , 2 . 3 n − 2 ) Codes
C is an (n,M, d)q code over Fq of length n with M codewords and minimum distance d. The code C can be either linear or nonlinear. A t − (v, k, λ) design D is a set X of v points together with a collection of k−subsets of X (called block) such that every t−subset of X is contained in exactly λ blocks. In this paper a new binary code ( n−1 2 , 3n−1 2 , 2.3 n−2), n ≥ 3 is developed. Some propertie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015